Discrete topology on N-dimensional square tessellated grids
نویسنده
چکیده
Topology preservation and detection is a well known concept in the processing of 2and 3-dimensional binary images. These images can be considered as sets that are mapped on square tessellated (hyper cubic) grids. This paper describes how the formalisms derived for 2D and 3D images can be expanded to N-dimensional images, i.e. binary point sets that are aligned on an N-dimensional square tessellated grid. Topology preserving thinning of objects in an image, informally referred to as skeletonization, is based on the successive erosion of the boundary of an object until locally a primitive shape is detected, e.g. in 3D a surface or a curve. The detection of primitive shapes is done using shape primitives. The generation of shape primitive detectors is based on the possibility to describe the primitives for intrinsic or object dimensions ~ NZNK1 by quadratic equations of the form xN Z Pðanxx CbnxnÞ: From this, primitives for lower object dimensions can be derived. A formula is derived that predicts the number of unique shape primitives in each dimension. Their application in measurements on shapes, in conditions for topology detection as used in topology preserving thinning, as well as the determination of standing wave patterns in topological kernels, is described. Finally as on each element of an image at least one of the primitives matches, this can be used to measure the total content of length, area, volume, etc from the objects in the image. q 2005 Elsevier B.V. All rights reserved.
منابع مشابه
On topology preservation of mixed operators in triangular, square, and hexagonal grids
Cím: On topology preservation of mixed operators in triangular, square, and hexagonal grids
متن کاملCoding cells of digital spaces: a framework to write generic digital topology algorithms
This paper proposes a concise coding of the cells of n-dimensional finite regular grids. It induces a simple, generic and efficient framework for implementing classical digital topology data structures and algorithms. Discrete subsets of multidimensional images (e.g. regions, digital surfaces, cubical cell complexes) have then a common and compact representation. Moreover, algorithms have a str...
متن کاملA TWO-STAGE SIMP-ACO METHOD FOR RELIABILITY-BASED TOPOLOGY OPTIMIZATION OF DOUBLE LAYER GRIDS
For reliability-based topology optimization (RBTO) of double layer grids, a two-stage optimization method is presented by applying “Solid Isotropic Material with Penalization” and “Ant Colony Optimization” (SIMP-ACO method). To achieve this aim, first, the structural stiffness is maximized using SIMP. Then, the characteristics of the obtained topology are used to enhance ACO through six modific...
متن کاملDiscrete configuration spaces of squares and hexagons
We consider generalizations of the familiar fifteen-piece sliding puzzle on the 4 by 4 square grid. On larger grids with more pieces and more holes, asymptotically how fast can we move the puzzle into the solved state? We also give a variation with sliding hexagons. The square puzzles and the hexagon puzzles are both discrete versions of configuration spaces of disks, which are of interest in s...
متن کاملA discrete duality finite volume discretization of the vorticity-velocity-pressure formulation of the 2D Stokes problem on almost arbitrary two-dimensional grids
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Image Vision Comput.
دوره 23 شماره
صفحات -
تاریخ انتشار 2005